QuickRank: A Recursive Ranking Algorithm
نویسندگان
چکیده
This paper presents QuickRank, an efficient algorithm for ranking individuals in a society, given a network that encodes their relationships, assuming that network possesses an accompanying hierarchical structure: e.g., the Enron email database together with the corporation’s organizational chart. The QuickRank design is founded on the “peer-review” principle, defined herein, and an hypothesis due to Bonacich. Together, these premises leads to a recursive ranking algorithm which is scalable, parallelizable, and easily updateable. Moreover, it is also potentially more resistant to link-spamming than other popular ranking algorithms.
منابع مشابه
QuickRank: a C++ Suite of Learning to Rank Algorithms
Ranking is a central task of many Information Retrieval (IR) problems, particularly challenging in the case of large-scale Web collections where it involves effectiveness requirements and efficiency constraints that are not common to other ranking-based applications. This paper describes QuickRank, a C++ suite of efficient and effective Learning to Rank (LtR) algorithms that allows high-quality...
متن کاملA new approach for Robot selection in manufacturing using the ellipsoid algorithm
The choice of suitable robots in manufacturing, to improve product quality and to increase productivity, is a complicated decision due to the increase in robot manufacturers and configurations. In this article, a novel approach is proposed to choose among alternatives, differently assessed by decision makers on different criteria, to make the final evaluation for decision-making. The approach i...
متن کاملPost-Learning Optimization of Tree Ensembles
Learning to Rank (LtR) is the machine learning method of choice for producing highly effective ranking functions. However, efficiency and effectiveness are two competing forces and trading off effectiveness for meeting efficiency constraints typical of production systems is one of the most urgent issues. This extended abstract shortly summarizes the work in [4] proposing CLEaVER, a new framewor...
متن کاملGenerating and ranking of Dyck words
A new algorithms to generate all Dyck words is presented, which is used in ranking and unranking Dyck words. We emphasize the importance of using Dyck words in encoding objects related to Catalan numbers. As a consequence of formulas used in the ranking algorithm we can obtain a recursive formula for the nth Catalan number.
متن کاملA tree-based ranking algorithm and approximation of the optimal ROC curve
Recursive partitioning methods are among the most popular techniques in machine-learning. It is the purpose of this paper to investigate how such an appealing methodology may be adapted to the bipartite ranking problem. In ranking, the goal pursued is global: the matter is to learn how to define an order on the whole feature space X , so that positive instances take up the top ranks with maximu...
متن کامل